Search Results

[POPL'22] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr

[POPL'22] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs (Teaser)

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs (Teaser)

[SRC POPL'22] Michael Fitzgibbons -- CapableWasm: Bringing Better Interop Down to WebAssembly

[SRC POPL'22] Michael Fitzgibbons -- CapableWasm: Bringing Better Interop Down to WebAssembly

[POPL'22] Software Model-Checking as Cyclic-Proof Search

[POPL'22] Software Model-Checking as Cyclic-Proof Search

[POPL'22] Type-Level Programming with Match Types

[POPL'22] Type-Level Programming with Match Types

[POPL 2021] Verifying Observational Robustness Against a C11-style Memory Model (full)

[POPL 2021] Verifying Observational Robustness Against a C11-style Memory Model (full)

[POPL'22] A Cost-Aware Logical Framework

[POPL'22] A Cost-Aware Logical Framework

[Session Previews @ POPL'23] Automated Verification

[Session Previews @ POPL'23] Automated Verification

[POPL'22] Oblivious Algebraic Data Types

[POPL'22] Oblivious Algebraic Data Types

[POPL 2021] A Separation Logic for Effect Handlers (full)

[POPL 2021] A Separation Logic for Effect Handlers (full)

[POPL 2021] On Algebraic Abstractions for Concurrent Separation Logics (full)

[POPL 2021] On Algebraic Abstractions for Concurrent Separation Logics (full)

Ori Lahav - Repairing Sequential Consistency in C/C++11

Ori Lahav - Repairing Sequential Consistency in C/C++11